An exposition of the topological half of the Grothendieck–Hirzebruch–Riemann–Roch theorem in the fancy language of spectra

We give an informal exposition of pushforwards and orientations in generalized cohomology theories in the language of spectra. The whole note can be seen as an attempt at convincing the reader that Todd classes in Grothendieck–Hirzebruch–Riemann–Roch type formulas are not Devil’s appearances but rather that things just go in the most natural possible way.

1. Download : Download high-res image (126KB)
2. Download : Download full-size image

     

Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

对称向量拟均衡问题有效解的存在性

利用标量化方法建立对称向量拟均衡问题有效解的存在性定理。作为标量化方法的应用，利用这一方法得到向量变分不等式和拟向量变分不等式有效解的存在性定理。     

A new idea to construct the fractal interpolation function

The aim of this paper is to present a new idea to construct the nonlinear fractal interpolation function, in which we exploit the Matkowski and the Rakotch fixed point theorems. Our technique is different from the methods presented in the previous literatures.     

NIFTy 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters

NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

Semi-concurrent vector fields in Finsler geometry

In the present paper, we give an answer to a question which is closely related to doubly warped product of Finsler metrics: ‘‘For each n, is there an n-dimensional Finsler manifold $(M,F)$, admitting a non-constant smooth function f on M such that $\frac{\partial f}{\partial x^i}\frac{\partial g^{ij}}{\partial y^k}=0$?”. We relate the preceding mentioned condition to different concepts appeared and studied in Finsler geometry. We introduce and investigate the notion of a semi concurrent vector field on a Finsler manifold. We show that some special Finsler manifolds admitting such vector fields turn out to be Riemannian. We prove that Tachibana's characterization of Finsler manifolds admitting a concurrent vector field leads to Riemannian metrics. Various examples for conic Finsler spaces that admit semi-concurrent vector field are presented.